Some Iterative Methods for Solving Equilibrium Problems and Optimization Problems
نویسندگان
چکیده
We introduce a new iterative scheme for finding a common element of the set of solutions of the equilibrium problems, the set of solutions of variational inequality for a relaxed cocoercive mapping, and the set of fixed points of a nonexpansive mapping. The results presented in this paper extend and improve some recent results of Ceng and Yao 2008 , Yao 2007 , S. Takahashi andW. Takahashi 2007 , Marino and Xu 2006 , Iiduka and Takahashi 2005 , Su et al. 2008 , and many others.
منابع مشابه
A New Iterative Algorithm for Multivalued Nonexpansive Mappping and Equlibruim Problems with Applications
In this paper, we introduce two iterative schemes by a modified Krasnoselskii-Mann algorithm for finding a common element of the set of solutions of equilibrium problems and the set of fixed points of multivalued nonexpansive mappings in Hilbert space. We prove that the sequence generated by the proposed method converges strongly to a common element of the set of solutions of equilibruim proble...
متن کاملAn Iterative Scheme for Generalized Equilibrium, Variational Inequality and Fixed Point Problems Based on the Extragradient Method
The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...
متن کاملAn efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کاملINTRODUCTION AND DEVELOPMENT OF SURROGATE MANAGEMENT FRAMEWORK FOR SOLVING OPTIMIZATION PROBLEMS
In this paper, we have outlined the surrogate management framework for optimization of expensive functions. An initial simple iterative method which we call the “Strawman” method illustrates how surrogates can be incorporated into optimization to stand in for the most expensive function. These ideas are made rigorous by incorporating them into the framework of pattern search methods. The SMF al...
متن کامل